Graph-intersecting set systems and LYM inequalities
نویسندگان
چکیده
منابع مشابه
Union-Intersecting Set Systems
Three intersection theorems are proved. First, we determine the size of the largest set system, where the system of the pairwise unions is l-intersecting. Then we investigate set systems where the union of any s sets intersect the union of any t sets. The maximal size of such a set system is determined exactly if s + t ≤ 4, and asymptotically if s + t ≥ 5. Finally, we exactly determine the maxi...
متن کاملPolynomial Lym Inequalities
For a Sperner family A ⊆ 2 [n] let Ai denote the family of all i-element sets in A. We sharpen the LYM inequality i |Ai|/ n i ≤ 1 by adding to the LHS all possible products of fractions |Ai|/ n i , with suitable coefficients. A corresponding inequality is established also for the linear lattice and the lattice of subsets of a multiset (with all elements having the same multiplicity).
متن کاملIntersecting set systems and graphic matroids,
Two simple proofs are given to an earlier partial result about an extremal set theoretic conjecture of Chung, Frank!, Graham, Shearer and Faudree, Schelp, S6s, respectively. The statement is slightly strengthened within a matroid theoretic framework. The first proof re lies on results from matroid theory, while the second is based on an explicit constJuction providing an elementary proof. @ 199...
متن کاملPseudo-LYM inequalities and AZ identities
We give pseudo-LYM inequalities in some posets and give a new restriction in this way for their antichains. Typically these posets fail the LYM inequality and some of them are known not to be Sperner.
متن کاملRecovering Set Systems and Graph Entropy
A relationship between a new and an old graph invariant is established. The first invariant is connected to the 'sandglass conjecture' of [1]. The second one is graph entropy, an information theoretic functional, which is already known to be relevant in several combinatorial contexts.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.08.027